A Note on Lattice-face Polytopes and Their Ehrhart Polynomials
نویسنده
چکیده
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in [6], and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope still has the property that each coefficient is the normalized volume of a projection of the original polytope. Furthermore, we show that the new family of lattice-face polytopes contains all possible combinatorial types of rational polytopes.
منابع مشابه
Ehrhart Polynomials of Lattice-face Polytopes
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any d-dimensional simplex in general position into d! signed sets, each of which corresponds to a permutation in the symmetric group Sd, and reduce the problem of...
متن کاملNotes on the Roots of Ehrhart Polynomials
We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n , where n is the dimension. This improves on the previously best known bound n and complements a recent result of Braun [8] where it is shown that the norm of a root of a Ehrhart po...
متن کاملLower bounds on the coefficients of Ehrhart polynomials
We present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of their volume. We also introduce two formulas for calculating the Ehrhart series of a kind of a ”weak” free sum of two lattice polytopes and of integral dilates of a polytope. As an application of these formulas we show that Hibi’s lower bound on the coefficients of the Ehrhart series is n...
متن کاملContributions to the Theory of Ehrhart Polynomials
In this thesis, we study the Ehrhart polynomials of different polytopes. In the 1960's Eugene Ehrhart discovered that for any rational d-polytope P, the number of lattice points, i(P,m), in the mth dilated polytope mP is always a quasi-polynomial of degree d in m, whose period divides the least common multiple of the denominators of the coordinates of the vertices of P. In particular, if P is a...
متن کاملNotes on lattice points of zonotopes and lattice-face polytopes
Minkowski’s second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski’s bound by replacing the volume by the lattice point enumerator of a convex body. To this we are interested in bounds on the coefficients of Ehrhart polynomials of lattice polytopes via the successive minima. Our resu...
متن کامل